Properties of Rank Metric Codes
نویسندگان
چکیده
This paper investigates general properties of codes with the rank metric. First, we investigate asymptotic packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties. Finally, we establish several identities that relate the rank weight distribution of a linear code to that of its dual code. One of our identities is the counterpart of the MacWilliams identity for the Hamming metric, and it has a different form from the identity by Delsarte.
منابع مشابه
Rank-Metric Codes and $q$-Polymatroids
We study some algebraic and combinatorial invariants of rank-metric codes, specifically generalized weights. We introduce q-polymatroids, the q-analogue of polymatroids, and develop their basic properties. We show that rank-metric codes give rise to q-polymatroids, and that several of their structural properties are captured by the associated combinatorial object. Introduction and Motivation Du...
متن کاملProperties of codes in rank metric
We study properties of rank metric and codes in rank metric over finite fields. We show that perfect codes do not exist. We derive an equivalent of the Varshamov-Gilbert bound in Hamming metric. We study the asymptotic behavior of the minimum rank distance of codes that are on GV. We show that the packing density of maximum rank distance codes is lower bounded by a function depending on the err...
متن کاملProperties of Codes with the Rank Metric
In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD co...
متن کاملOn the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes
Rank metric codes can either be used as such for error correction in data storage equipments, or be lifted into constant-dimension codes (CDCs) and thus be used for error correction in random network coding. This paper investigates the decoder error probability (DEP) of rank metric codes and CDCs. We first study the DEP of rank metric codes using a bounded rank distance decoder. We derive asymp...
متن کاملCodes Endowed With the Rank Metric
We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix representation. We then investigate the combinatorial structure of MRD codes and optimal anticodes in the rank metric, describing how they relate to each other.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0702077 شماره
صفحات -
تاریخ انتشار 2007